232^3 Quantified Boolean Formula Games and Their Complexities

Consider QBF, the Quantified Boolean Formula problem, as a combinatorial game ruleset. The problem is rephrased as determining the winner of the game where two opposing players take turns assigning values to boolean variables. In this paper, three common variations of games are applied to create seven new games: whether each player is restricted to where they may play, which values they may set variables to, or the condition they are shooting for at the end of the game. The complexity for determining which player can win is analyzed for all games. Of the seven, two are trivially in P and the other five are PSPACE-complete. These varying properties are common for combinatorial games; reductions from these five hard games can simplify the process for showing the PSPACE-hardness of other games.Comment: 14 pages, 0 figures, for Integers 2013 Conference proceeding

Impartial coloring games

Coloring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of $k > 0$ colors. Each different ruleset specifies that game's coloring constraints. This paper investigates six impartial rulesets (five new), derived from previously-studied graph coloring schemes, including proper map coloring, oriented coloring, 2-distance coloring, weak coloring, and sequential coloring. For each, we study the outcome classes for special cases and general computational complexity. In some cases we pay special attention to the Grundy function

Data Structures Lecture Notes (Student Version)

Lecture notes for a data-structures course in computer science with examples in Java. Students in this course should have already taken an intro-programming course in an object-oriented language and have a basic grasp of Java. These are not designed to accompany any specific textbook

Intro Programming Lecture Notes (Student Version)

Lecture notes for an introductory programming course in Python (version 3.x). There are many example problems suitable for flipped classes. This follows the order of Allen Downey\u27s Think Python text. Some sections are skipped, but the basics are included through inheritance and polymorphism. No prior programming experience is expected

Software Engineering Lecture Notes (Student Version)

Lecture notes for an upper-level undergraduate software engineering course, with a strong focus on software design. Students taking this course should have already completed a data structures course. These notes are designed to be used with Dale Skrien’s text Object Oriented Design using Java

Forced Capture Hnefatafl

We define a new, partizan, loopy combinatorial game, Forced-Capture Hnefatafl, similar to Hnefatafl, except that players are forced to make capturing moves when available. We show that this game is PSPACE-hard using a reduction from Constraint Logic, making progress towards classifying proper Hnefatafl.Comment: 12 pages, 9 figures, 4 open problem